Scheduling Independent Jobs on Computational Grid using Biogeography Based Optimization Algorithm for Makespan Reduction
نویسندگان
چکیده
Due to the development of information and network technologies, idle computers all over the world can be organized and utilized to enhance the overall computation performance. Grid computing refers to the combination of computer resources from multiple administrative domains used to reach a common goal. Grids offer a way of using the information technology resources optimally inside an organization. As the grid environments facilitate distributed computation, the scheduling of grid jobs has become an important issue. This study introduces a novel approach based on Biogeography Based Optimization algorithm (BBO) for scheduling jobs on computational grid. The proposed approach generates an optimal schedule so as to complete the jobs within a minimum period of time. The performance of the proposed algorithm has been evaluated with Genetic Algorithm (GA), Differential Evolution algorithm (DE), Ant Colony Optimization algorithm (ACO) and Particle Swarm Optimization algorithm (PSO).
منابع مشابه
Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...
متن کاملScheduling jobs on computational grid using Differential Evolution algorithm
-Large scale computation is frequently limited to the performance of computer hardware or associated cost. Due to the development of information and network technologies, idle computers all over the world can be utilized and organized to enhance overall computation performance. Grid environments facilitate distributed computation. Hence the scheduling of grid jobs should be considered as an imp...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملSolving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization
This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...
متن کامل